Trie-Lexicon-Driven On-line Handwritten Japanese Disease Name Recognition

نویسندگان

  • Bilan ZHU
  • Masaki NAKAGAWA
چکیده

This paper describes a lexicon-driven approach to on-line handwritten Japanese disease name recognition using a time-synchronous method. A trie lexicon is constructed from a disease name database containing 21,713 disease name phrases. It expands the search space using time-synchronous method and applies the beam search strategy to search segmentation candidate lattice constructed based on primitive segments. This method restricts the character categories of recognizing each character candidate pattern from the trie lexicon of disease names and preceding paths during path search in the segmentation candidate lattice, and selects an optimal disease name from the disease names database as recognition result. The experimental results demonstrate the effectiveness of our proposed method, which improves the character recognition rate from 94.56% to 99.97% compared with a general-purpose Japanese text recognizer and the recognition speed is also 4.3 times faster.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lexicon-Driven Handwritten Character String Recognition for Japanese Address Reading

This paper proposes a handwritten character string recognition method for Japanese mail address reading on very large vocabulary. The recognition is performed by classification-embedded lexicon matching based on over-segmentation. The lexicon contains 111,349 address phrases and is represented in a trie structure. In recognition, the input text line image is matched with all lexicon entries by ...

متن کامل

Segmentation-free MRF Recognition Method in Combination with P2DBMN-MQDF for Online Handwritten Cursive Word

This paper describes an online handwritten English cursive word recognition method using a segmentation-free Markov random field (MRF) model in combination with an offline recognition method which uses pseudo 2D bi-moment normalization (P2DBMN) and modified quadratic discriminant function (MQDF). It extracts feature points along the pen-tip trace from pen-down to pen-up and uses the feature poi...

متن کامل

Lexical Post-Processing Optimization for Handwritten Word Recognition

This paper presents a lexical post-processing optimization for handwritten word recognition. The aim of this work is to explore the combination of different lexical postprocessing approaches in order to optimize the recognition rate, the recognition time and memory requirements. The present method focuses on the following tasks: a lexicon organization with word filtering, based on holistic word...

متن کامل

A Distributed Scheme for Lexicon-Driven Handwritten Word Recognition and its Application to Large Vocabulary Problems

Many off–line handwritten word recognition systems have been proposed since the early nineties. Most systems reported high recognition rates, however, they overlooked a very important factor in the process; speed factor. In this paper we explore the potential for speeding up an off–line handwritten word recognition system via concurrency. The goal of the system is to achieve both full accuracy ...

متن کامل

A Lexicon-Driven Handwritten City-Name Recognition Scheme for Indian Postal Automation

A lexicon-driven segmentation-recognition scheme on Bangla handwritten city-name recognition is proposed for Indian postal automation. In the proposed scheme, at first, binarization of the input document is done and then to take care of slanted handwriting of different individuals a slant correction technique is performed. Next, due to the script characteristics of Bangla, a water reservoir con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010